Set operations

Results: 454



#Item
31Graph theory / Graph operations / NP-complete problems / Bipartite graphs / Combinatorial optimization / Matching / Line graph / Chordal graph / Clique / Complete bipartite graph / Independent set / Cograph

New Results on Maximum Induced Matchings in Bipartite Graphs and Beyond Konrad K. Dabrowskia,b , Marc Demangec,d , Vadim V. Lozina a DIMAP b School

Add to Reading List

Source URL: community.dur.ac.uk

Language: English - Date: 2013-03-14 00:55:15
32Mathematics / Operations research / Computational complexity theory / Combinatorics / Combinatorial optimization / NP-complete problems / Set cover problem / Greedy algorithm / Heuristic / Integer programming / Matching / Linear programming

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. 26, NO. X,

Add to Reading List

Source URL: www.cs.uoi.gr

Language: English - Date: 2014-10-21 22:17:09
33Graph theory / Graph operations / NP-complete problems / Chordal graph / Clique / Graph minor / Edge contraction / Tree decomposition / Vertex / Split graph / Graph / Independent set

Contracting a chordal graph to a split graph or a tree? Petr A. Golovach1 , Marcin Kami´ nski2 , and 1 Dani¨el Paulusma

Add to Reading List

Source URL: rutcor.rutgers.edu

Language: English - Date: 2011-07-20 16:48:47
34Mathematics / NP-complete problems / Theory of computation / Scheduling / Theoretical computer science / Combinatorial optimization / Independent set / Makespan / Approximation algorithm / Matching / Operations research / Truthful job scheduling

Anna Adamaszek, Andreas Wiese Tutorials: Marvin K¨ unnemann Summer 2014

Add to Reading List

Source URL: resources.mpi-inf.mpg.de

Language: English - Date: 2014-06-04 08:45:27
35Pharmaceutical industry / Validity / Business / Validation / Database / Verification and validation / Space Weather Prediction Center / Value ethics) / Evaluation

NAIRAS OPS NAIRAS Operations Report 1 August 25, 2008 SET NAIRAS Ops Team

Add to Reading List

Source URL: sol.spacenvironment.net

Language: English - Date: 2008-08-25 15:37:00
36Mathematics / Operations research / Linear programming / Combinatorial optimization / Convex optimization / Submodular set function / Valuation / Approximation algorithm / Randomized rounding / Ellipsoid method / Mathematical optimization / Algorithm

CS364B: Frontiers in Mechanism Design Lecture #10: Coverage Valuations and Convex Rounding∗ Tim Roughgarden† February 5, 2014

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2014-06-11 16:25:54
37Mathematics / Mathematical optimization / Operations research / Computational problems / Submodular set function / Pareto efficiency / Algorithm / Economics / Optimization problem / Applied mathematics

Same bang, fewer bucks: efficient discovery of the cost-influence skyline Matthijs van Leeuwen∗ Abstract Antti Ukkonen†

Add to Reading List

Source URL: www.patternsthatmatter.org

Language: English - Date: 2015-01-26 10:40:46
38Income distribution / Economy / Profit / Net income / Income tax in the United States / Earnings before interest and taxes / Flat tax / Taxation in the United States / Wealth tax

24 Management´s Discussion and analysis of financial condition and results of operations Set forth below are our consolidated results for the years ended December 31, 2007 andResults included have been prepared

Add to Reading List

Source URL: i2.esmas.com

Language: English - Date: 2010-05-11 13:45:17
39Computational complexity theory / Mathematics / Theory of computation / NP-complete problems / Operations research / Approximation algorithms / Combinatorial optimization / Set cover problem / Linear programming relaxation / Greedy algorithm / Facility location problem / Reduction

PASS Approximation: A Framework for Analyzing and Designing Heuristics Uriel Feige ∗† Nicole Immorlica ∗‡

Add to Reading List

Source URL: users.eecs.northwestern.edu

Language: English - Date: 2009-09-15 22:21:32
40Computational complexity theory / Mathematics / Theory of computation / Operations research / NP-hard problems / Analysis of algorithms / Asymptotic analysis / Big O notation / Mathematical notation / NP / Travelling salesman problem / Gap reduction

CS2101 Due: Tuesday 2nd of December 2014 Problem Set 3 CS2101

Add to Reading List

Source URL: www.csd.uwo.ca

Language: English - Date: 2014-11-27 12:00:09
UPDATE